Serveur d'exploration Cyberinfrastructure

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Fast algorithms and heuristics for phylogenomics under ILS and hybridization

Identifieur interne : 000350 ( Main/Exploration ); précédent : 000349; suivant : 000351

Fast algorithms and heuristics for phylogenomics under ILS and hybridization

Auteurs : Yun Yu [États-Unis] ; Nikola Ristic [États-Unis] ; Luay Nakhleh [États-Unis]

Source :

RBID : PMC:3852049

Abstract

Background

Phylogenomic analyses involving whole-genome or multi-locus data often entail dealing with incongruent gene trees. In this paper, we consider two causes of such incongruence, namely, incomplete lineage sorting (ILS) and hybridization, and consider both parsimony and probabilistic criteria for dealing with them.

Results

Under the assumption of ILS, computing the probability of a gene tree given a species tree is a very hard problem. We present a heuristic for speeding up the computation, and demonstrate how it scales up computations to data sizes that are not feasible to analyze using current techniques, while achieving very good accuracy. Further, under the assumption of both ILS and hybridization, computing the probability of a gene tree and parsimoniously reconciling it with a phylogenetic network are both very hard problems. We present two exact algorithms for these two problems that speed up existing techniques significantly and enable analyses of much larger data sets than is currently feasible.

Conclusion

Our heuristics and algorithms enable phylogenomic analyses of larger (in terms of numbers of taxa) data sets than is currently feasible. Further, our methods account for ILS and hybridization, thus allowing analyses of reticulate evolutionary histories.


Url:
DOI: 10.1186/1471-2105-14-S15-S6
PubMed: 24564257
PubMed Central: 3852049


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Fast algorithms and heuristics for phylogenomics under ILS and hybridization</title>
<author>
<name sortKey="Yu, Yun" sort="Yu, Yun" uniqKey="Yu Y" first="Yun" last="Yu">Yun Yu</name>
<affiliation wicri:level="2">
<nlm:aff id="I1">Department of Computer Science, Rice University, Houston, TX, USA</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, Rice University, Houston, TX</wicri:regionArea>
<placeName>
<region type="state">Texas</region>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Ristic, Nikola" sort="Ristic, Nikola" uniqKey="Ristic N" first="Nikola" last="Ristic">Nikola Ristic</name>
<affiliation wicri:level="2">
<nlm:aff id="I1">Department of Computer Science, Rice University, Houston, TX, USA</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, Rice University, Houston, TX</wicri:regionArea>
<placeName>
<region type="state">Texas</region>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Nakhleh, Luay" sort="Nakhleh, Luay" uniqKey="Nakhleh L" first="Luay" last="Nakhleh">Luay Nakhleh</name>
<affiliation wicri:level="2">
<nlm:aff id="I1">Department of Computer Science, Rice University, Houston, TX, USA</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, Rice University, Houston, TX</wicri:regionArea>
<placeName>
<region type="state">Texas</region>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">PMC</idno>
<idno type="pmid">24564257</idno>
<idno type="pmc">3852049</idno>
<idno type="url">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3852049</idno>
<idno type="RBID">PMC:3852049</idno>
<idno type="doi">10.1186/1471-2105-14-S15-S6</idno>
<date when="2013">2013</date>
<idno type="wicri:Area/Pmc/Corpus">000226</idno>
<idno type="wicri:Area/Pmc/Curation">000226</idno>
<idno type="wicri:Area/Pmc/Checkpoint">000329</idno>
<idno type="wicri:Area/Ncbi/Merge">000501</idno>
<idno type="wicri:Area/Ncbi/Curation">000501</idno>
<idno type="wicri:Area/Ncbi/Checkpoint">000501</idno>
<idno type="wicri:Area/Main/Merge">000351</idno>
<idno type="wicri:Area/Main/Curation">000350</idno>
<idno type="wicri:Area/Main/Exploration">000350</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a" type="main">Fast algorithms and heuristics for phylogenomics under ILS and hybridization</title>
<author>
<name sortKey="Yu, Yun" sort="Yu, Yun" uniqKey="Yu Y" first="Yun" last="Yu">Yun Yu</name>
<affiliation wicri:level="2">
<nlm:aff id="I1">Department of Computer Science, Rice University, Houston, TX, USA</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, Rice University, Houston, TX</wicri:regionArea>
<placeName>
<region type="state">Texas</region>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Ristic, Nikola" sort="Ristic, Nikola" uniqKey="Ristic N" first="Nikola" last="Ristic">Nikola Ristic</name>
<affiliation wicri:level="2">
<nlm:aff id="I1">Department of Computer Science, Rice University, Houston, TX, USA</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, Rice University, Houston, TX</wicri:regionArea>
<placeName>
<region type="state">Texas</region>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Nakhleh, Luay" sort="Nakhleh, Luay" uniqKey="Nakhleh L" first="Luay" last="Nakhleh">Luay Nakhleh</name>
<affiliation wicri:level="2">
<nlm:aff id="I1">Department of Computer Science, Rice University, Houston, TX, USA</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Computer Science, Rice University, Houston, TX</wicri:regionArea>
<placeName>
<region type="state">Texas</region>
</placeName>
</affiliation>
</author>
</analytic>
<series>
<title level="j">BMC Bioinformatics</title>
<idno type="eISSN">1471-2105</idno>
<imprint>
<date when="2013">2013</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass></textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">
<sec>
<title>Background</title>
<p>Phylogenomic analyses involving whole-genome or multi-locus data often entail dealing with incongruent gene trees. In this paper, we consider two causes of such incongruence, namely, incomplete lineage sorting (ILS) and hybridization, and consider both parsimony and probabilistic criteria for dealing with them.</p>
</sec>
<sec>
<title>Results</title>
<p>Under the assumption of ILS, computing the probability of a gene tree given a species tree is a very hard problem. We present a heuristic for speeding up the computation, and demonstrate how it scales up computations to data sizes that are not feasible to analyze using current techniques, while achieving very good accuracy. Further, under the assumption of both ILS and hybridization, computing the probability of a gene tree and parsimoniously reconciling it with a phylogenetic network are both very hard problems. We present two exact algorithms for these two problems that speed up existing techniques significantly and enable analyses of much larger data sets than is currently feasible.</p>
</sec>
<sec>
<title>Conclusion</title>
<p>Our heuristics and algorithms enable phylogenomic analyses of larger (in terms of numbers of taxa) data sets than is currently feasible. Further, our methods account for ILS and hybridization, thus allowing analyses of reticulate evolutionary histories.</p>
</sec>
</div>
</front>
<back>
<div1 type="bibliography">
<listBibl>
<biblStruct>
<analytic>
<author>
<name sortKey="Maddison, Wp" uniqKey="Maddison W">WP Maddison</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Syring, J" uniqKey="Syring J">J Syring</name>
</author>
<author>
<name sortKey="Willyard, A" uniqKey="Willyard A">A Willyard</name>
</author>
<author>
<name sortKey="Cronn, R" uniqKey="Cronn R">R Cronn</name>
</author>
<author>
<name sortKey="Liston, A" uniqKey="Liston A">A Liston</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Pollard, Da" uniqKey="Pollard D">DA Pollard</name>
</author>
<author>
<name sortKey="Iyer, Vn" uniqKey="Iyer V">VN Iyer</name>
</author>
<author>
<name sortKey="Moses, Am" uniqKey="Moses A">AM Moses</name>
</author>
<author>
<name sortKey="Eisen, Mb" uniqKey="Eisen M">MB Eisen</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Than, C" uniqKey="Than C">C Than</name>
</author>
<author>
<name sortKey="Sugino, R" uniqKey="Sugino R">R Sugino</name>
</author>
<author>
<name sortKey="Innan, H" uniqKey="Innan H">H Innan</name>
</author>
<author>
<name sortKey="Nakhleh, L" uniqKey="Nakhleh L">L Nakhleh</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Kuo, Ch" uniqKey="Kuo C">CH Kuo</name>
</author>
<author>
<name sortKey="Wares, Jp" uniqKey="Wares J">JP Wares</name>
</author>
<author>
<name sortKey="Kissinger, Jc" uniqKey="Kissinger J">JC Kissinger</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Cranston, Ka" uniqKey="Cranston K">KA Cranston</name>
</author>
<author>
<name sortKey="Hurwitz, B" uniqKey="Hurwitz B">B Hurwitz</name>
</author>
<author>
<name sortKey="Ware, D" uniqKey="Ware D">D Ware</name>
</author>
<author>
<name sortKey="Stein, L" uniqKey="Stein L">L Stein</name>
</author>
<author>
<name sortKey="Wing, Ra" uniqKey="Wing R">RA Wing</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="White, M" uniqKey="White M">M White</name>
</author>
<author>
<name sortKey="Ane, C" uniqKey="Ane C">C Ane</name>
</author>
<author>
<name sortKey="Dewey, C" uniqKey="Dewey C">C Dewey</name>
</author>
<author>
<name sortKey="Larget, B" uniqKey="Larget B">B Larget</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Hobolth, A" uniqKey="Hobolth A">A Hobolth</name>
</author>
<author>
<name sortKey="Dutheil, J" uniqKey="Dutheil J">J Dutheil</name>
</author>
<author>
<name sortKey="Hawks, J" uniqKey="Hawks J">J Hawks</name>
</author>
<author>
<name sortKey="Schierup, M" uniqKey="Schierup M">M Schierup</name>
</author>
<author>
<name sortKey="Mailund, T" uniqKey="Mailund T">T Mailund</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Takuno, S" uniqKey="Takuno S">S Takuno</name>
</author>
<author>
<name sortKey="Kado, T" uniqKey="Kado T">T Kado</name>
</author>
<author>
<name sortKey="Sugino, Rp" uniqKey="Sugino R">RP Sugino</name>
</author>
<author>
<name sortKey="Nakhleh, L" uniqKey="Nakhleh L">L Nakhleh</name>
</author>
<author>
<name sortKey="Innan, H" uniqKey="Innan H">H Innan</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Degnan, J" uniqKey="Degnan J">J Degnan</name>
</author>
<author>
<name sortKey="Salter, L" uniqKey="Salter L">L Salter</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Wu, Y" uniqKey="Wu Y">Y Wu</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Staubach, F" uniqKey="Staubach F">F Staubach</name>
</author>
<author>
<name sortKey="Lorenc, A" uniqKey="Lorenc A">A Lorenc</name>
</author>
<author>
<name sortKey="Messer, P" uniqKey="Messer P">P Messer</name>
</author>
<author>
<name sortKey="Tang, K" uniqKey="Tang K">K Tang</name>
</author>
<author>
<name sortKey="Petrov, D" uniqKey="Petrov D">D Petrov</name>
</author>
<author>
<name sortKey="Tautz, D" uniqKey="Tautz D">D Tautz</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Moody, M" uniqKey="Moody M">M Moody</name>
</author>
<author>
<name sortKey="Rieseberg, L" uniqKey="Rieseberg L">L Rieseberg</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Than, C" uniqKey="Than C">C Than</name>
</author>
<author>
<name sortKey="Ruths, D" uniqKey="Ruths D">D Ruths</name>
</author>
<author>
<name sortKey="Innan, H" uniqKey="Innan H">H Innan</name>
</author>
<author>
<name sortKey="Nakhleh, L" uniqKey="Nakhleh L">L Nakhleh</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Meng, C" uniqKey="Meng C">C Meng</name>
</author>
<author>
<name sortKey="Kubatko, Ls" uniqKey="Kubatko L">LS Kubatko</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Kubatko, Ls" uniqKey="Kubatko L">LS Kubatko</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Joly, S" uniqKey="Joly S">S Joly</name>
</author>
<author>
<name sortKey="Mclenachan, Pa" uniqKey="Mclenachan P">PA McLenachan</name>
</author>
<author>
<name sortKey="Lockhart, Pj" uniqKey="Lockhart P">PJ Lockhart</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Yu, Y" uniqKey="Yu Y">Y Yu</name>
</author>
<author>
<name sortKey="Than, C" uniqKey="Than C">C Than</name>
</author>
<author>
<name sortKey="Degnan, J" uniqKey="Degnan J">J Degnan</name>
</author>
<author>
<name sortKey="Nakhleh, L" uniqKey="Nakhleh L">L Nakhleh</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Jones, G" uniqKey="Jones G">G Jones</name>
</author>
<author>
<name sortKey="Sagitov, S" uniqKey="Sagitov S">S Sagitov</name>
</author>
<author>
<name sortKey="Oxelman, B" uniqKey="Oxelman B">B Oxelman</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Yu, Y" uniqKey="Yu Y">Y Yu</name>
</author>
<author>
<name sortKey="Barnett, R" uniqKey="Barnett R">R Barnett</name>
</author>
<author>
<name sortKey="Nakhleh, L" uniqKey="Nakhleh L">L Nakhleh</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Yu, Y" uniqKey="Yu Y">Y Yu</name>
</author>
<author>
<name sortKey="Degnan, J" uniqKey="Degnan J">J Degnan</name>
</author>
<author>
<name sortKey="Nakhleh, L" uniqKey="Nakhleh L">L Nakhleh</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Than, C" uniqKey="Than C">C Than</name>
</author>
<author>
<name sortKey="Ruths, D" uniqKey="Ruths D">D Ruths</name>
</author>
<author>
<name sortKey="Nakhleh, L" uniqKey="Nakhleh L">L Nakhleh</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Nakhleh, L" uniqKey="Nakhleh L">L Nakhleh</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Tavare, S" uniqKey="Tavare S">S Tavaré</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Than, C" uniqKey="Than C">C Than</name>
</author>
<author>
<name sortKey="Nakhleh, L" uniqKey="Nakhleh L">L Nakhleh</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Doyon, Jp" uniqKey="Doyon J">JP Doyon</name>
</author>
<author>
<name sortKey="Hamel, S" uniqKey="Hamel S">S Hamel</name>
</author>
<author>
<name sortKey="Chauve, C" uniqKey="Chauve C">C Chauve</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Rambaut, A" uniqKey="Rambaut A">A Rambaut</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Robinson, D" uniqKey="Robinson D">D Robinson</name>
</author>
<author>
<name sortKey="Foulds, L" uniqKey="Foulds L">L Foulds</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Hudson, Rr" uniqKey="Hudson R">RR Hudson</name>
</author>
</analytic>
</biblStruct>
</listBibl>
</div1>
</back>
</TEI>
<affiliations>
<list>
<country>
<li>États-Unis</li>
</country>
<region>
<li>Texas</li>
</region>
</list>
<tree>
<country name="États-Unis">
<region name="Texas">
<name sortKey="Yu, Yun" sort="Yu, Yun" uniqKey="Yu Y" first="Yun" last="Yu">Yun Yu</name>
</region>
<name sortKey="Nakhleh, Luay" sort="Nakhleh, Luay" uniqKey="Nakhleh L" first="Luay" last="Nakhleh">Luay Nakhleh</name>
<name sortKey="Ristic, Nikola" sort="Ristic, Nikola" uniqKey="Ristic N" first="Nikola" last="Ristic">Nikola Ristic</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000350 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000350 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    CyberinfraV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     PMC:3852049
   |texte=   Fast algorithms and heuristics for phylogenomics under ILS and hybridization
}}

Pour générer des pages wiki

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/RBID.i   -Sk "pubmed:24564257" \
       | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd   \
       | NlmPubMed2Wicri -a CyberinfraV1 

Wicri

This area was generated with Dilib version V0.6.25.
Data generation: Thu Oct 27 09:30:58 2016. Site generation: Sun Mar 10 23:08:40 2024